A Gray Code for Combinations of a Multiset

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Gray Code for Combinations of a Multiset

Let C k n n nt denote the set of all k element combinations of the multiset consisting of ni occurrences of i for i t Each combination is itself a multiset For example C ff g f g f g f gg We show that multiset combinations can be listed so that successive combina tions di er by one element Multiset combinations simultaneously generalize for which minimal change listings called Gray codes are kn...

متن کامل

" A Gray Code Counter

In this correspondence, an information-theoretical evaluation of radix sorting of symbols is given.

متن کامل

investigating the feasibility of a proposed model for geometric design of deployable arch structures

deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...

Genetic Code as a Gray Code Revisited

In this paper we revisit the idea of relating the genetic code to a Gray code. This idea was originally fostered by Rosemary Swanson as a “unifying concept for the amino acid code”. We show that cyclic arrangements of the codons which are different from the one proposed by Swanson, but which are still based on the principle of minimal change, yield a better grouping of the amino acids by simila...

متن کامل

A Gray Code for Set Partitions

We consider here the collection of all partitions of an n-set, for fixed n, and we ask: is it possible to arrange these partitions in a list (Gray Code) so that each partition is obtained from its immediate predecessor by changing the class of exactly one element? The answer is affirmative, and we give descriptions of two algorithms which implement the method, the first recursive, the second no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 1996

ISSN: 0195-6698

DOI: 10.1006/eujc.1996.0043